<HTML><HEAD><TITLE>bfs_instance(++BfsInstance)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(bfs)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>bfs_instance(++BfsInstance)</H1>
Initialises the bfs instance BfsInstance.
<DL>
<DT><EM>BfsInstance</EM></DT>
<DD>Bfs instance name (atom)
</DD>
</DL>
<H2>Description</H2>
  <P>
  Initialises the bfs instance BfsInstance. A bfs instance is an
  instance of the best first search solver, with which node
  relaxation and separation solvers can be associated and used to
  optimise the problem constraints posted to the relaxed node solver
  with respect to its objective using a specified node ordering scheme.
  In particular best-first and best-estimate search schemes are
  supported and application-specific schemes may be easily defined by
  the user.
  </P><P>
  If BfsInstance is not an already existing bfs instance, a new bfs
  instance will be created and initialised. If it is an existing bfs
  instance, and it is not currently being used (having no associated
  solvers), it is effectively reinitialised. Otherwise, the predicate
  aborts with an error. Note that a bfs instance is a module, and each
  bfs instance can be associated with at most one relaxation and one
  separation solver at any time and vice versa.
  </P>
  
<H2>See Also</H2>
<A HREF="../../lib/bfs/integers-1.html">integers / 1</A>, <A HREF="../../lib/bfs/bfs_branch-1.html">bfs_branch / 1</A>, <A HREF="../../lib/bfs/node_info-5.html">node_info / 5</A>, <A HREF="../../lib/bfs/solver_setup-2.html">solver_setup / 2</A>, <A HREF="../../lib/bfs/solver_setup-3.html">solver_setup / 3</A>, <A HREF="../../lib/bfs/solve-1.html">solve / 1</A>, <A HREF="../../lib/bfs/get-2.html">get / 2</A>, <A HREF="../../lib/bfs/var_get-3.html">var_get / 3</A>, <A HREF="../../lib/bfs/statistics-0.html">statistics / 0</A>
</BODY></HTML>
